The critical node problem in stochastic networks with discrete-time Markov chain
نویسندگان
چکیده
منابع مشابه
The critical node problem in stochastic networks with discrete-time Markov chain
The length of the stochastic shortest path is defined as the arrival probability from a source node to a destination node. The uncertainty of the network topology causes unstable connections between nodes. A discrete-time Markov chain is devised according to the uniform distribution of existing arcs where the arrival probability is computed as a finite transition probability from the initial st...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملarrival probability in the stochastic networks with an established discrete time markov chain
the probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. a discrete time markov chain with an absorbing state is established in a directed acyclic network. then, the probability of transition from the initial state to the absorbing state is computed. it is as...
متن کاملDiscrete Time Markov Chain (DTMC)
A. A stochastic process is a collection of random variables {X t , t ∈ T }. B. A sample path or realization of a stochastic process is the collection of values assumed by the random variables in one realization of the random process, e.g. C. The state space is the collection of all possible values the random variables can take on, i.e. it is the sample space of the random variables. For example...
متن کاملDiscrete Time Stochastic Networks
In this section we study the relation between throughput and queue-length distributions in discrete-time closed cyclic networks when the number of customers and the number of nodes grows unboundedly. To state our findings more precisely: For each positive integer N , consider a cyclic network with n(N) nodes and k(N) customers. We suppose that there are only finitely many types of nodes. That i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Croatian Operational Research Review
سال: 2016
ISSN: 1848-0225,1848-9931
DOI: 10.17535/crorr.2016.0003